A Priori Error Analysis and Spring Arithmetic
نویسندگان
چکیده
Error analysis is defined by the following concern: Bounding the output variation of a (nonlinear) function with respect to a given variation of the input variables. This paper investigates this issue in the framework of interval analysis. The classical way of analyzing the error is to linearize the function around the point corresponding to the actual input, but this method is local and not reliable. Both drawbacks can be easily circumvented by a combined use of interval arithmetic and domain splitting. However, because of the underlying linearization, a standard interval algorithm leads to a pessimistic bound, and even simply fails (i.e., returns an infinite error) in case of singularity. We propose an original nonlinear approach where intervals are used in a more sophisticated way through the so-called springs. This new structure allows one to represent an (infinite) set of intervals constrained by their midpoints and their radius. The output error is then calculated with a spring arithmetic in the same way as the image of a function is calculated with interval arithmetic. Our method is illustrated on two examples, including an application of geopositioning.
منابع مشابه
A Priori Error Analysis with Intervals
Error analysis is defined by the following concern: bounding the output variation of a (nonlinear) function with respect to a given variation of the input variables. This paper investigates this issue in the framework of interval analysis. The classical way of analyzing the error is to linearize the function around the point corresponding to the actual input, but this method is local and not re...
متن کاملA Comparison of Fpga Implementations of the a Priori Error-feedback Lsl Algorithm Using Logarithmic Arithmetic
In this paper we present an implementation of the Modified A Priori Error-Feedback LSL (EF-LSL) algorithm [1] on the VIRTEX FPGA. Internally, the computations are based on 32bit or 20bit logarithmic arithmetic. The cores outperform the standard DSP solution based on 32 bit floating point TMS320C3x/4x 50MHz processors.
متن کاملA Note on a Verified Automatic Integration Algorithm
A verified integration algorithm is proposed for calculating s-dimensional integrals over a finite domain using numerical computations. To construct an efficient verified numerical integrator, the truncation error and the rounding error need to be considered. It has been known that interval arithmetic is one of the most efficient methods of evaluating the rounding error. However, it is much slo...
متن کاملRobust Residue Codes for Fault-Tolerant Public-Key Arithmetic
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very high probability of detecting arbitrary errors of any weight. Our scheme lends itself well for straightforward implementation of standard modular multiplication techniques, i.e. Montgomery or Barrett Multiplication, sec...
متن کاملCompensated Horner algorithm in K times the working precision
We introduce an algorithm to evaluate a polynomial with oating point coe cients as accurately as the Horner scheme performed in K times the working precision, for K an arbitrary integer. The principle is to iterate the error-free transformation of the compensated Horner algorithm and to accurately sum the nal decomposition. We prove this accuracy property with an a priori error analysis. We ill...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 31 شماره
صفحات -
تاریخ انتشار 2009